Jumping Machines.

Stream Cipher Design based on Jumping Finite State Machines

This paper presents a new way of constructing binary cascade clock-controlled LFSR sequence generators as building blocks for stream ciphers. In these constructions the bottleneck of multiple clocking shift registers is removed, resulting in so called jump-controlled sequence generators, that operate in a single clock pulse and are most efficient to implement. The constructions make use of spec...

Jumping and Non-Jumping Genes

The term ‘horizontal transfer (HT)’ refers to the transfer of genetic material between two reproductively isolated organisms. HT is thought to occur rarely in eukaryotes compared to vertical inheritance, the transmission of DNA from parent to offspring. In a recent study we have provided evidence that a family of DNA transposons, called SPACE INVADERS or SPIN, independently invaded horizontally...

Jumping Sequences

An integer sequence a(n) is called a jump sequence if a(1) = 1 and 1 ≤ a(n) < n for n ≥ 2. Such a sequence has the property that ak(n) = a(a(· · · (a(n)) · · · )) goes to 1 in finitely many steps. We call the pattern (n, a(n), a2(n), . . . , al(n) = 1) a jumping pattern from n down to 1. In this paper we look at jumping sequences that are weight minimizing with respect to various weight functio...

Jumping Champions

Jumping nanodroplets.

Flat gold nanostructures on inert substrates like glass or graphite were illuminated by single intensive laser pulses with fluences above the gold melting threshold. The liquid structures produced in this way are far from their equilibrium shape, and a dewetting process sets in. On a time scale of a few nanoseconds, the liquid contracted toward a sphere. During this contraction, the center of m...